On Computing Longest Paths in Small Graph Classes

نویسندگان

  • Ryuhei Uehara
  • Yushi Uno
چکیده

The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that the longest path problem can be solved efficiently for weighted trees, block graphs, and cacti. We next show that the longest path problem can be solved efficiently on some graph classes that have natural interval representations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Paths in Series-Parallel Graphs

In 1966 Gallai asked whether all longest paths in a connected graph intersect in a common vertex. This is not true in general and various counterexamples have been found. However, many well-known classes of graphs have the socalled Gallai property, e.g. trees and outerplanar graphs. Recently, de Rezende et al. proved that 2-trees, which are maximal series-parallel graphs, also have this propert...

متن کامل

A note on longest paths in circular arc graph

As observed by Rautenbach and Sereni [SIAM J. Discrete Math. 28 (2014) 335–341] there is a gap in the proof of the theorem of Balister et al. [Combin. Probab. Comput. 13 (2004) 311–317], which states that the intersection of all longest paths in a connected circular arc graph is nonempty. In this paper we close this gap.

متن کامل

Nonempty intersection of longest paths in series-parallel graphs

In 1966 Gallai asked whether all longest paths in a connected graph have nonempty intersection. This is not true in general and various counterexamples have been found. However, the answer to Gallai’s question is positive for several well-known classes of graphs, as for instance connected outerplanar graphs, connected split graphs, and 2-trees. A graph is series-parallel if it does not contain ...

متن کامل

Independent sets and non-augmentable paths in generalizations of tournaments

We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable path (in particular, every longest path). The classes are the arclocal tournament, quasi-transitive, locally in-semicomplete (out-semicomplete), and semicomplete k-partite digraphs. We present results on strongly intern...

متن کامل

An experimental analysis of local minima to improve neighbourhood search

The paper reports a number of experiments with local search algorithms applied to job shop scheduling. The main aim was to get insights into the structure of the underlying conguration space. We consider the disjunctive graph representation where the objective function of job shop scheduling is equal to the length of longest paths. In particular, we analyse the number of longest paths, and our ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Found. Comput. Sci.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2007